A Recursively Axiomatizable Subsystem of Levesque\'s Logic of Only Knowing
نویسنده
چکیده
A complete, recursive axiomatization of a subsystem of Levesque’s only-knowing logic is given. The sublogic is obtained by relaxing some of Levesque’s semantic conditions while keeping the most important definitions unchanged. The axiom system is obtained by adding an axiom of Humberstone to a subset of the set of Levesque’s axioms. The completeness result is proved using the subordination method of Hughes and Cresswell.
منابع مشابه
Levesque's Axiomatization of only Knowing is Incomplete
We show that the axiomatization given by Levesque for his logic of \only knowing" (Levesque 1990), which he showed to be sound and complete for the unquantiied version of the logic and conjectured to be complete for the full logic, is in fact incomplete.
متن کاملComplexity of Only Knowing: The Propositional Case
We study the computational properties of the propositional fragment of Levesque's logic of only knowing. In particular, we show that the problem of reasoning with only knowing in the propositional case lies at the second level of the polynomial hierarchy. Thus, it is as hard as reasoning in the majority of propositional formalisms for nonmonotonic reasoning, like default logic, circumscription ...
متن کاملAxiomatizing the monodic fragment of first-order temporal logic
It is known that even seemingly small fragments of the rst-order temporal logic over the natural numbers are not recursively enumerable. In this paper we show that the monodic (not monadic, where this result doesn't hold) fragment is an exception by constructing its nite Hilbert-style axiomatization. We also show that the monodic fragment with equality is not recursively axiomatizable.
متن کاملAndrás Simon COMPLEXITY OF EQUATIONAL THEORY OF RELATIONAL ALGEBRAS WITH PROJECTION ELEMENTS
In connection with a problem of L. Henkin and J.D. Monk we show that the variety generated by TPA’s – relation algebras (RA’s) expanded with concrete set theoretical projection functions – and the first–order theory of the class TPA are not axiomatizable by any decidable set of axioms. Indeed, we show that Eq(TPA) – all equations valid in TPA – is exactly on the Π1 level. The same applies if we...
متن کاملA solution to a problem of urquhart
In [4], Urquhart gives an example of a modal logic which has the finite model property, is recursively axiomatizable but not decidable. He poses the problem of finding such a logic containing S4. We will solve this problem by constructing a logic which in addition to the required properties also defines a locally finite variety of modal algebras. (Recall that a variety is said to be locally fin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- JACIII
دوره 7 شماره
صفحات -
تاریخ انتشار 2003